Matrix Analysis of Synchronous Boolean Networks
نویسندگان
چکیده
منابع مشابه
Dynamics of Scale-Free Semi-Synchronous Boolean Networks
Random Boolean Networks have been introduced by Kauffman more than thirty years ago as a highly simplified model of genetic regulatory networks. These models are interesting in their own as complex dynamical systems and have been throughly studied as such. We believe that the original view of Kauffman is still a valid one, provided that the model is updated to take into account present knowledg...
متن کاملAnalysis of Boolean Networks Using an Optimized Algorithm of Structure Matrix Based on Semi-tensor Product
The structure matrix based on semi-tensor product can provide formulas for analyzing the characteristics of a Boolean network, such as the number of fixed points, the number of circles of different lengths, transient period for all points to enter the set of attractors and basin of each attractor. However, the conventional method of semi-tensor product gains the structure matrix through complex...
متن کاملControl Flow Analysis of Generalised Boolean Networks
Generalised Boolean Networks are a well known qualitative model used to analyse the evolution of genetic networks as well as generic biological pathways. Despite the qualitative abstraction due to the few threshold concentration values considered for each biological element in the model, the complexity of the execution of a Generalised Boolean model could be non trivial. In this paper, we propo...
متن کاملState-space analysis of Boolean networks
This paper provides a comprehensive framework for the state-space approach to Boolean networks. First, it surveys the authors' recent work on the topic: Using semitensor product of matrices and the matrix expression of logic, the logical dynamic equations of Boolean (control) networks can be converted into standard discrete-time dynamics. To use the state-space approach, the state space and its...
متن کاملGenerating probabilistic Boolean networks from a prescribed transition probability matrix.
Probabilistic Boolean networks (PBNs) have received much attention in modeling genetic regulatory networks. A PBN can be regarded as a Markov chain process and is characterised by a transition probability matrix. In this study, the authors propose efficient algorithms for constructing a PBN when its transition probability matrix is given. The complexities of the algorithms are also analysed. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematical, Engineering and Management Sciences
سال: 2021
ISSN: 2455-7749
DOI: 10.33889/ijmems.2021.6.2.036